A Discrete Global Minimization Algorithm for Continuous Variational Problems
نویسندگان
چکیده
In this paper, we apply the ideas from combinatorial optimization to find globally optimal solutions to continuous variational problems. At the heart of our method is an algorithm to solve for globally optimal discrete minimal surfaces. This discrete surface problem is a natural generalization of the planar-graph shortest path problem.
منابع مشابه
Strong convergence of a general implicit algorithm for variational inequality problems and equilibrium problems and a continuous representation of nonexpansive mappings
We introduce a general implicit algorithm for finding a common element of the set of solutions of systems of equilibrium problems and the set of common fixed points of a sequence of nonexpansive mappings and a continuous representation of nonexpansive mappings. Then we prove the strong convergence of the proposed implicit scheme to the unique solution of the minimization problem on the so...
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کاملA New Optimal Solution Concept for Fuzzy Optimal Control Problems
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
متن کاملDISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM
Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004